Universally Programmable Quantum Cellular Automaton
نویسندگان
چکیده
منابع مشابه
A universal quantum cellular automaton
We will prove the existence of a universal quantum cellular automaton. Such qca are defined as the quantum-mechanical pendant of classical one-dimensional cellular automata. As is the case with quantum Turing machines, the well-formedness restriction plays an important role. It will be shown that every proper qca obeys a local constraint which is comparable with the ‘inverse neighborhood’ of cl...
متن کاملQuantum cellular automaton for universal quantum computation
A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...
متن کاملCellular-Automaton Decoders for Topological Quantum Memories
Decoders are one of the necessary building blocks for robust local quantum memories, basic primitives that must arguably be part of any functioning topological quantum computer. While surface codes have raised the prospects for scalability and performance of quantum storage devices, the task of decoding resorts to complicated classical algorithms. Such decoding algorithms are typically designed...
متن کاملSemiclassical simulation of quantum cellular automaton circuits
We present a simulator for quantum cellular automaton (QCA) circuits, based on a semiclassical model and aimed at the determination of the error probability in the presence of thermal excitations. Di erent methods are discussed; either a complete exploration of the con guration space, or a partial exploration by means of simulated annealing. Results for the probability of obtaining the ground s...
متن کاملA quantum Samaritan’s dilemma cellular automaton
The dynamics of a spatial quantum formulation of the iterated Samaritan's dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed in fair and unfair contests, in noiseless scenarios and with disrupting quantum noise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2006
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.97.020502